CCCG 2011, Toronto ON, August 10–12, 2011 Exact Algorithms and APX-Hardness Results for Geometric Set Cover Timothy M. Chan∗ Abstract

Source URL: www.cccg.ca

• Approximation algorithms
• Functions and mappings
• Computational complexity theory
• APX
• Logarithm
• Integral
• Function
• L-reduction
• Metric
• Mathematics
• Theoretical computer science
• Mathematical analysis

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number ? Michael Fellows1,2 and Frances Rosamond1

Source URL: www.mrfellows.net

• NP-complete problems
• Analysis of algorithms
• Parameterized complexity
• Kernelization
• Bidimensionality
• Dominating set
• Tree decomposition
• Path decomposition
• Feedback vertex set
• Theoretical computer science
• Computational complexity theory
• Graph theory

Limits and Applications of Group Algebras for Parameterized Problems Ioannis Koutis Computer Science Department Carnegie Mellon University

Source URL: ccom.uprrp.edu

• Analysis of algorithms
• Polynomials
• Algebraic geometry
• Commutative algebra
• Parameterized complexity
• XTR
• Kernelization
• Randomized algorithm
• Time complexity
• Theoretical computer science
• Mathematics
• Computational complexity theory

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 On a geometric approach to the segment sum problem and its generalization Asish Mukhopadhyay Abstract

Source URL: cccg.ca

• Analysis of algorithms
• Time complexity
• Algorithm
• Selection algorithm
• SL
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Jiang et al. BMC Bioinformatics 2015, 16(Suppl 5):S7 http://www.biomedcentral.comS5/S7 PROCEEDINGS Open Access

Source URL: www.biomedcentral.com

• Operations research
• Computational complexity theory
• Parameterized complexity
• Integer
• Linear programming
• XTR
• Abstract algebra
• Mathematics
• Algebra

The Exact Computational Complexity of Evolutionarily Stable Strategies Vincent Conitzer Department of Computer Science Duke University Durham, NC, USA

Source URL: www.cs.duke.edu

Downloaded from http://rsta.royalsocietypublishing.org/ on May 24, 2015 Phil. Trans. R. Soc. A, 3432–3448 doi:rstaCertifiable quantum dice

Source URL: rsta.royalsocietypublishing.org

• Theoretical computer science
• Information theory
• Computational complexity theory
• Randomness extractor
• Random number generation
• Entropy
• Pseudorandomness
• Algorithmically random sequence
• Min-entropy
• Randomness
• Cryptography
• Applied mathematics

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Counting Triangulations Approximately Victor Alvarez∗ Karl Bringmann†

Source URL: www.cccg.ca

• Analysis of algorithms
• Triangulation
• Computational complexity theory
• Time complexity
• Algorithm
• Randomized algorithm
• Big O notation
• Delaunay triangulation
• Planar separator theorem
• Theoretical computer science
• Mathematics
• Applied mathematics

CS 373 Final Exam (December 15, 2000) Fall 2000

Source URL: web.engr.illinois.edu

• Complexity classes
• NP-complete problems
• Mathematical optimization
• NP-hard
• Time complexity
• NP
• Independent set
• P versus NP problem
• Clique
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Faster Secure Two-Party Computation Using Garbled Circuits Yan Huang David Evans University of Virginia

Source URL: www.usenix.org

• Computational complexity theory
• Logic gates
• Circuit complexity
• Secure multi-party computation
• Levenshtein distance
• XOR gate
• Boolean circuit
• Circuit
• Adder
• Theoretical computer science
• Applied mathematics
• Cryptographic protocols